Deterministic concurrent strategies
نویسندگان
چکیده
منابع مشابه
Extracting Non-Deterministic Concurrent Programs
We introduce an extension of intuitionistic fixed point logic by a modal operator facilitating the extraction of non-deterministic concurrent programs from proofs. We apply this extension to program extraction in computable analysis, more precisely, to computing with Tsuiki’s infinite Gray code for real numbers. 1998 ACM Subject Classification F.1.2 Modes of Computation, F.3.1 Specifying and Ve...
متن کاملObservably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Although Plotkin’s parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures – in which an event has a unique causal history – because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We sho...
متن کاملNon-Deterministic Concurrent Logic Programming in Pandora
Want to get experience? Want to get any ideas to create new things in your life? Read non deterministic concurrent logic programming in pandora now! By reading this book as soon as possible, you can renew the situation to get the inspirations. Yeah, this way will lead you to always think more and more. In this case, this book will be always right for you. When you can observe more about the boo...
متن کاملAn Algebra of Concurrent Non-Deterministic Processes
Cherkasova, L.A., and V.E. Kotov, An algebra of concurrent nondeterminstic processes, Theoretical Computer Science 90 (1991) 151-170. This paper illustrates how early ideas and simple naive concepts of concurrency theory of the 1960s have now turned into complex and subtle problems of modern calculi of concurrent processes. An algebra of finite processes AFP, is discussed as an example of resea...
متن کاملReasoning About Deterministic Concurrent Functional I/O
This paper develops a language for reasoning about concurrent functional I/O. We assume that the API is specified as statetransformers on a single world state. We then prove that under certain conditions evaluation in this language is deterministic, and give some examples. All properties were machine-verified using the Sparkle proofassistant and using Core-Clean as a meta-language.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2012
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-012-0235-6